QIRO: A Static Single Assignment-based Quantum Program Representation for Optimization

نویسندگان

چکیده

We propose an IR for quantum computing that directly exposes and classical data dependencies the purpose of optimization. The Quantum Intermediate Representation Optimization (QIRO) consists two dialects, one input dialect is specifically tailored to enable quantum-classical co-optimization. While first employs a perhaps more intuitive memory-semantics (quantum operations act as side-effects), latter uses value-semantics (operations consume produce states). Crucially, this encodes dataflow in IR, allowing host optimizations leverage analysis. discuss how map existing programming languages lower resulting optimization dialect. present prototype implementation based on MLIR includes several quantum-specific passes. Our benchmarks show significant improvements resource requirements are possible even through static In contrast circuit at run time, achieved while incurring only small constant overhead compilation making compelling approach program application scale.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anticipation-based partial redundancy elimination for static single assignment form

Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) execution paths of a program without increasing any path length. Chow, Kennedy, et al. devised an algorithm (SSAPRE) for performing partial redundancy elimination on intermediate representation in static single assignment (SSA) ...

متن کامل

Adapting Static Single Assignment for Hardware Compilation

This paper describes methods for synthesizing the internal representation of a compiler into a hardware description language; a process often referred to as hardware compilation. We present a framework for this transformation including methods to control the path of execution and ways to deal with the data communication. We show how static single assignment (SSA) is useful to reduce the amount ...

متن کامل

Minimal Static Single Assignment Form

This formalization is an extension to [3]. In their work, the authors have shown that Braun et al.’s static single assignment (SSA) construction algorithm [1] produces minimal SSA form for input programs with a reducible control flow graph (CFG). However Braun et al. also proposed an extension to their algorithm that they claim produces minimal SSA form even for irreducible CFGs. In this formal...

متن کامل

STATIC AND DYNAMIC OPPOSITION-BASED LEARNING FOR COLLIDING BODIES OPTIMIZATION

Opposition-based learning was first introduced as a solution for machine learning; however, it is being extended to other artificial intelligence and soft computing fields including meta-heuristic optimization. It not only utilizes an estimate of a solution but also enters its counter-part information into the search process. The present work applies such an approach to Colliding Bodies Optimiz...

متن کامل

Interprocedural Static Single Assignment Form in Bauhaus

In this paper we describe interprocedural static single assignment form (ISSA) with optimizations as implemented in the Bauhaus project. We explain our framework which uses an abstract program representation enabling us to use different pointer analyses ranging from fast but imprecise to slow but precise ones. Our implementation includes the computation of (may and must) side effects and optimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM transactions on quantum computing

سال: 2022

ISSN: ['2643-6817', '2643-6809']

DOI: https://doi.org/10.1145/3491247